Snap-Stabilization in Message-Passing Systems Brief Announcement

نویسندگان

  • Sylvie Delaët
  • Stéphane Devismes
  • Mikhail Nesterenko
  • Sébastien Tixeuil
چکیده

In this announcement, we report recent results [4] (available at http://arxiv.org/abs/0802. 1123) where we address the open problem of snap-stabilization in message-passing systems. The concept of snap-stabilization [3] offers an attractive approach to transient fault tolerance. As soon as such fault ends a snap-stabilizing protocol immediately operates correctly. Of course, not all safety predicates can be guaranteed when the system is started from an arbitrary global state. Snap-stabilization’s notion of safety is user-centric: when the user initiates a request, then the received response is correct. However, between the request and the response, the system can behave arbitrarily (except from giving an erroneous response to the user). A related well-studied concept is self-stabilization [5]. After the end of a transient fault, a selfstabilizing protocol eventually satisfies its specification. Thus, snap-stabilization offers stronger safety guarantee than self-stabilization: it may take an arbitrary long time for a self-stabilizing protocol to start behaving correctly after the fault. However, all snap-stabilizing protocols presented thus far used a high-atomicity execution model: each process is able to read the states of its neighbors and update its own state in one atomic step. It was unclear if snap-stabilization is possible in more realistic finer atomicity execution models such as message-passing systems. The contribution of this work is twofold.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Brief Annoucement: Snap-Stabilization in Message-Passing Systems

In this announcement, we report recent results where we address the open problem of snap-stabilization in messagepassing systems. (A full version of this paper is available as [3] at http://arxiv.org/abs/0802.1123.)

متن کامل

Snap-Stabilizing PIF on Non-oriented Trees and Message Passing Model

Starting from any configuration, a snap-stabilizing protocol guarantees that the system always behaves according to its specification while a self-stabilizing protocol only guarantees that the system will behave according to its specification in a finite time. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). That property is very s...

متن کامل

Brief Announcement: Sharing Memory in a Self-stabilizing Manner

Introduction. A core abstraction for many distributed algorithms simulates shared memory [3]; this abstraction allows to take algorithms designed for shared memory, and port them to asynchronous message-passing systems, even in the presence of failures. There has been significant work on creating such simulations, under various types of permanent failures, as well as on exploiting this abstract...

متن کامل

Self-Stabilizing Paxos

We present the first self-stabilizing consensus and replicated state machine for asynchronousmessage passing systems. The scheme does not require that all participants make a certain numberof steps prior to reaching a practically infinite execution where the replicated state machine exhibitsthe desired behavior. In other words, the system reaches a configuration from which it operat...

متن کامل

Brief Announcement: Partition Approach to Failure Detectors for k-Set Agreement

There have been several studies on failure detectors for solving k-set agreement, a problem that requires n processes to decide on at most k (k < n) values proposed by the n processes in systems where processes may fail by crashing. In particular, Mostefaoui et.al. study the relationship among these failure detector classes and show that class Ωk is the weakest among them to solve k-set agreeme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008